Characterising anonymity systems
نویسنده
چکیده
Privacy is a value shared by most human societies. The work presented here is inspired by this value and is concerned with methods by which it may be achieved. In a world where we increasingly make use of information systems amenable to surveillance, privacy is no longer an inherent assumption; it has becomes a property that must be explicitly designed. In this thesis we examine the background and motivation for privacy and how this goal may be achieved by use of systems that provide anonymity. We examine the underlying features of such systems, the variety of strategies that may be employed to achieve this aim, and the limitations of these methods. We employ a definition of anonymity based on various applications of random choice to introduce unpredictability into the sequences of observable events created by the exchange of messages between actors in communicating systems. This leads to a characterisation of anonymity systems according to the fundamental mechanism that they employ to maximise this unpredictability. The characterisation that we propose leads us to identify four fundamental anonymity strategies, corresponding to known mechanisms that introduce randomness in communicating processes. These strategies form a classification applicable to all anonymity systems, which allows us to consider in isolation the separate strategies for achieving anonymity. Taking this approach we show that each fundamental strategy is individually sufficient to provide anonymity to communicating entities. We analyse the anonymity strategies identified in the model through a simulation-based approach, and employ an information theoretic quantification to compare the anonymity provided by each type of system. The fundamental strategies are simulated both individually and as part of larger networks, and are compared with respect to the effectiveness of each approach in confusing an observer’s ability to link communicating actors. Finally, we demonstrate that combining strategies in a single system can improve anonymity beyond that of individual strategies. Our results show the relative effectiveness of a range of anonymity systems
منابع مشابه
Rethinking $(k,\ell)$-anonymity in social graphs: $(k,\ell)$-adjacency anonymity and $(k,\ell)$-(adjacency) anonymous transformations
This paper treats the privacy-preserving publication of social graphs in the presence of active adversaries, that is, adversaries with the ability to introduce sybil nodes in the graph prior to publication and leverage them to create unique fingerprints for a set of victim nodes and re-identify them after publication. Stemming from the notion of (k, l)-anonymity, we introduce (k, l)-anonymous t...
متن کاملOn the anonymity of anonymity systems
Anonymity on the Internet is a property commonly identified with privacy of electronic communications. A number of different systems exist which claim to provide anonymous email and web browsing, but their effectiveness has hardly been evaluated in practice. In this thesis we focus on the anonymity properties of such systems. First, we show how the anonymity of anonymity systems can be quantifi...
متن کاملAnonymity v . s . Information Leakage in a Anonymity Systems ∗
Measures for anonymity in systems must be on one hand simple and concise, and on the other hand reflect the realities of real systems. Such systems are heterogeneous, as are the ways they are used, the deployed anonymity measures, and finally the possible attack methods. Implementation quality and topologies of the anonymity measures must be considered as well. We therefore propose a new measur...
متن کاملHow to Bypass Two Anonymity Revocation Schemes
In recent years, there have been several proposals for anonymous communication systems that provide intentional weaknesses to allow anonymity to be circumvented in special cases. These anonymity revocation schemes attempt to retain the properties of strong anonymity systems while granting a special class of people the ability to selectively break through their protections. We evaluate the two d...
متن کاملWeighted Factors for Evaluating Anonymity
Many systems provide anonymity for their users, and most of these systems work on the separation between the users’ identity and the final destination. The level of anonymity these services provide is affected by several factors, some of which are related to the design of the anonymity service itself. Others are related to how the system is used or the user’s application/purpose in using the an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007